perm filename CATALO[S78,JMC]3 blob sn#496568 filedate 1980-02-13 generic text, type C, neo UTF8
COMMENT āŠ—   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	Here are some course descriptions.  Changing the number of 206 to 122
C00006 ENDMK
CāŠ—;
Here are some course descriptions.  Changing the number of 206 to 122
and introducing 222 was tentatively agreed by the Curriculum Committee
last year, but they or at least its chairman should review the matter.
CS226 will be considered for cross-listing in philosophy.

122. Recursive Programming and Proving - Recursive programming using
the LISP language and techniques for proving the corrrectness of
recursive programs.  Computing with symbolic expressions
rather than numbers, e.g. algebraic expressions, logical expressions,
patterns, graphs, and computer programs.
Pattern matching and syntax directed computation.  Preparation for
work in artificial intelligence is emphasized.
Prerequisite: 107 or equivalent ability to program.

222. Programming languages for artificial Intelligence - Advanced LISP,
Microplanner, QA4, Scheme.  Production systems and other forms of
pattern-directed computation.  Applications to problem solving and
language understanding.
Prerequisite: 122, 224 or consent of the instructor.

Here is a new version of catalog material for cs226.

226. Epistemological Problems of Artificial Intelligence - Formalisms for
representing what a general intelligent program must know about the common
sense world including facts about causality, ability, knowledge and
action.  Modes of rigorous and conjectural reasoning, especially
non-monotonic reasoning.  Approximate theories and counterfactuals.
Connections with philosophy, especially philosophical logic and
epistemology.  Some familiarity with first order logic will be assumed.

258. Mathematical Theory of Computation - Abstract syntax and formal
semantics of programming languages.  Recursively defined and algolic
programs.  Proving assertions about computer programs using formalisms of
Burstall, Cartwright, Floyd, Manna, McCarthy and Scott.  The emphasis
is on functional programs rather than sequential.  Use of
proof-checking programs.  Prerequisite: 156 with 166 recommended.